Localizing Object by Using only Image-level Labels

Weakly Supervised Object Localization (WSOL) task attracts more and more attention in recent years, which aims to locate the object by using incomplete labels. Considering the cost of annotation, especially ground-truth bounding box label and training speed of detection task, it is very necessary to improve the performance of WSOL that only requires image-level labels. Most current methods tend to utilize Class Activation Map (CAM) that can only highlight the most discriminative parts rather than the entire target. The common method to address this kind of limitation is to hide the most obvious regions and let the model learn other parts of the target. The main work of this thesis is to eliminate the limitations of current WSOL work and improve the performance of localization. In chapter 3, we design an attention-based selection strategy to dynamically hide the feature maps. In chapter 4, a new hiding method is proposed to further improve the localization performance. In chapter 5, we propose three method to eliminate the issues on CAM level. Our methods are evaluated on CUB-200-2011 and ILSVRC 2016 datasets. Experiments demonstrate that the proposed methods work very well and significantly improve the localization performance

LLL for ideal lattices re-evaluation of the security of Gentry-Halevi\u27s FHE scheme

The LLL algorithm, named after its inventors, Lenstra, Lenstra and Lovász, is one of themost popular lattice reduction algorithms in the literature. In this paper, we propose the first variant of LLL algorithm that is dedicated for ideal lattices, namely, the iLLL algorithm. Our iLLL algorithm takes advantage of the fact that within LLL procedures, previously reduced vectors can be re-used for further reductions. Using this method, we prove that the iLLL is at least as fast as the LLL algorithm, and it outputs a basis with the same quality. We also provide a heuristic approach that accelerates the re-use method. As a result, in practice, our algorithm can be approximately eight times faster than LLL algorithm for typical scenarios where lattice dimension is between 100 and 150. When applying our algorithm to the Gentry–Halevi’s fully homomorphic challenges, we are able to solve the toy challenge within 24 days using a 2.66GHz CPU, while with the classical LLL algorithm, it takes 32 days. Further, assuming a 4.0GHz CPU, we predict to reduce the basis in 15.7 years for the small challenges, while previous best prediction was 45 years

An SVP attack on Vortex

In [BS22], the authors proposed a lattice based hash function that is useful for building zero-knowledge proofs with superior performance. In this short note we analysis the underlying lattice problem with the classic shortest vector problem, and show that 2 out of 15 proposed parameter sets for this hash function do not achieve the claimed security

Benchmarking Omni-Vision Representation through the Lens of Visual Realms

Though impressive performance has been achieved in specific visual realms (e.g. faces, dogs, and places), an omni-vision representation generalizing to many natural visual domains is highly desirable. But, existing benchmarks are biased and inefficient to evaluate the omni-vision representation -- these benchmarks either only include several specific realms, or cover most realms at the expense of subsuming numerous datasets that have extensive realm overlapping. In this paper, we propose Omni-Realm Benchmark (OmniBenchmark). It includes 21 realm-wise datasets with 7,372 concepts and 1,074,346 images. Without semantic overlapping, these datasets cover most visual realms comprehensively and meanwhile efficiently. In addition, we propose a new supervised contrastive learning framework, namely Relational Contrastive learning (ReCo), for a better omni-vision representation. Beyond pulling two instances from the same concept closer -- the typical supervised contrastive learning framework -- ReCo also pulls two instances from the same semantic realm closer, encoding the semantic relation between concepts, and facilitating omni-vision representation learning. We benchmark ReCo and other advances in omni-vision representation studies that are different in architectures (from CNNs to transformers) and in learning paradigms (from supervised learning to self-supervised learning) on OmniBenchmark. We illustrate the superior of ReCo to other supervised contrastive learning methods and reveal multiple practical observations to facilitate future research.Comment: In ECCV 2022; The project page at https://zhangyuanhan-ai.github.io/OmniBenchmar

Bandersnatch: a fast elliptic curve built over the BLS12-381 scalar field

In this short note, we introduce Bandersnatch, a new elliptic curve built over the BLS12-381 scalar field. The curve is equipped with an efficient endomorphism, allowing a fast scalar multiplication algorithm. Our benchmark shows that the multiplication is 42% faster, compared to another curve, called Jubjub, having similar properties. Nonetheless, Bandersnatch does not provide any performance improvement for either rank 1 constraint systems (R1CS) or multi scalar multiplications, compared to the Jubjub curve

Optimizing polynomial convolution for NTRUEncrypt

NTRUEncrypt is one of the most promising candidates for quantum-safe cryptography. In this paper, we focus on the NTRU743 paramter set. We give a report on all known attacks against this parameter set and show that it delivers 256 bits of security against classical attackers and 128 bits of security against quantum attackers. We then present a parameter-dependent optimization using a tailored hierarchy of multipli- cation algorithms as well as the Intel AVX2 instructions, and show that this optimization is constant-time. Our implementation is two to three times faster than the reference implementation of NTRUEncrypt

Topside of the martian ionosphere near the terminator: Variations with season and solar zenith angle and implications for the origin of the transient layers

In this paper, the morphological variations of the M2 layer of the martian ionosphere with the martian seasons and solar zenith angle (SZA) at the terminator are investigated. The data used are the MARSIS (Mars Advanced Radar for Subsurface and Ionosphere Sounding) measurements (approximately 5000 ionograms) that were acquired from 2005 to 2012, which have a SZA ⩾ 85° and detect the topside transient layers. A simple, effective data inversion method is developed for the situation in which the upper portion of the height profile is non-monotonic and the observed data are insufficient for adequate reduction. The inverted parameters are subsequently explored using a statistical approach. The results reveal that the main body of the M2 layer (approximately 10 km below the first topside layer) can be well-characterized as a Chapman layer near the terminator (SZA = 85-98°), notwithstanding the high SZA and the presence of the topside layers. The height of the first topside layer tends to be concentrated approximately 60 km (with a standard deviation of ∼20 km) above the main density peak. The peak density and height of the first topside layer are positively correlated to the density and height of the main peak, respectively. The density and height of the first topside layer appear to be independent of the SZA, but possess seasonal variations that are similar to those of the main layer. The height of the topside layer is greater (by ∼10 km on average) in the southern spring and summer than in the southern autumn and winter, coinciding with the observation that, in the southern spring and summer, the underlying atmosphere is warmer due to dust heating (e.g., Smith, M.D. [2004]. Icarus 167, 148-165). The statistical regularities of the parameters suggest a possibility that the formation of the topside layers are closely related to the processes of photoionization and diffusion that occur on the topside of the M2 layer. We propose that development of beam-plasma instabilities in the transitional region (between the lower Chapman region and the upper transport-dominating region) is possibly a mechanism that is responsible for the occurrences of the topside layers